RECOGNIZING HINGE-FREE LINE GRAPHS AND TOTAL GRAPHS
نویسندگان
چکیده
منابع مشابه
Recognizing Hinge-free Line Graphs and Total Graphs
In this paper, we characterize line graphs and total graphs that are hinge-free, i.e., there is no triple of vertices x; y; z such that the distance between y and z increases after x is removed. Based on our characterizations, we show that given a graph G with n vertices and m edges, determining its line graph and total graph to be hinge-free can be solved in O(n + m) time. Moreover, characteri...
متن کاملRecognizing HHDS-Free Graphs
In this paper, we consider the recognition problem on the HHDS-free graphs, a class of homogeneously orderable graphs, and we show that it has polynomial time complexity. In particular, we describe a simple O(nm)-time algorithm which determines whether a graph G on n vertices and m edges is HHDS-free. To the best of our knowledge, this is the first polynomial-time algorithm for recognizing this...
متن کاملN-extendability of Line Graphs, Power Graphs, and Total Graphs
A graph G that has a perfect matching is n-extendable if every matching of size n lies in a perfect matching of G. We show that when the connectivity of a line graph, power graph, or total graph is sufficiently large then it is n-extendable. Specifically: if G has even size and is (2n + 1)edge-connected or (n + 2)-connected, then its line graph is n-extendable; if G has even order and is (n + 1...
متن کاملClaw-free graphs. VII. Quasi-line graphs
A graph is a quasi-line graph if for every vertex v, the set of neighbours of v is expressible as the union of two cliques. Such graphs are more general than line graphs, but less general than claw-free graphs. Here we give a construction for all quasi-line graphs; it turns out that there are basically two kinds of connected quasi-line graphs, one a generalization of line graphs, and the other ...
متن کاملLine graphs of triangle-free graphs
We present some results on the structure of line graphs of triangle-free graphs and discuss connections with homogeneity.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Taiwanese Journal of Mathematics
سال: 2001
ISSN: 1027-5487
DOI: 10.11650/twjm/1500574996